VGS Algorithm - An Efficient Deadlock Resolution Method
نویسندگان
چکیده
منابع مشابه
An Efficient Deadlock Detection and Resolution Algorithm for Generalized Deadlocks
In existing deadlock detection and resolution algorithms, only a few of them can handle deadlocks in generalized request models. Most of these algorithms diffuse probes and collect dependency information in the replies. In this paper, we propose an efficient algorithm to detect and resolve generalized deadlocks. In this algorithm, replies are sent after a process has received all the messages f...
متن کاملTime Efficient Deadlock Resolution Algorithms
Deadlock is a major concern in a distributed system, since resources are shared among processes at sites distributed across a network. One of the most accepted methods of deadlock handling is detection and resolution. Both deadlock prevention and avoidance strategies are conservative solutions, whereas deadlock detection is optimistic. Furthermore, by the nature of database access, deadlock pre...
متن کاملAn optimal deadlock resolution algorithm in multidatabase systems
In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of victims for removing deadlocks. It makes the use of network ow techniques, and runs in time O(n 3), where n is the number of the deadlocked global transactions. Furthermore, the proposed deadlock resolution algorithm dose...
متن کاملAn O(n) Distributed Deadlock Resolution Algorithm: Correctness Proof
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of previous proposals. The algorithm has a communication cost of 2n − 1 messages and a latency of n ·T for a deadlock cycle of n processes, where T is the inter-site communication delay. The algorithm achieves this improvemen...
متن کاملAn Efficient Deadlock
Over the years several locking protocols have been proposed for coordinating the concurrent use of a data base by multiple transactions. Of these, the non-two-phase locking (non-2PL) protocols form a large class. The Pitfall Protocol (PP) is one of the non-2PL protocols. While the rules of PP assure serializability, they do not prevent deadlocks from occurring. Resolution of a deadlock by parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/6230-8310